Linear Dilation-Erosion Perceptron Trained Using a Convex-Concave Procedure
نویسندگان
چکیده
Mathematical morphology (MM) is a theory of non-linear operators used for the processing and analysis images. Morphological neural networks (MNNs) are whose neurons compute morphological operators. Dilations erosions elementary MM. From an algebraic point view, dilation erosion that commute respectively with supremum infimum operations. In this paper, we present linear dilation-erosion perceptron (\(\ell \)-DEP), which given by applying transformations before computing erosion. The decision function \(\ell \)-DEP model defined adding Furthermore, training can be formulated as convex-concave optimization problem. We compare performance other machine learning techniques using several classification problems. computational experiments support potential application proposed binary tasks.
منابع مشابه
The Concave-Convex Procedure (CCCP)
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/energy functions. It can be applied to (almost) any optimization problem and many existing algorithms can be interpreted in terms of CCCP. In particular, we prove relationships to some applications of Legendre transform te...
متن کاملOn Convergence Rate of Concave-Convex Procedure
Concave-Convex Procedure (CCCP) has been widely used to solve nonconvex d.c.(difference of convex function) programs occur in learning problems, such as sparse support vector machine (SVM), transductive SVM, sparse principal componenent analysis (PCA), etc. Although the global convergence behavior of CCCP has been well studied, the convergence rate of CCCP is still an open problem. Most of d.c....
متن کاملA Convex-Concave Relaxation Procedure Based Subgraph Matching Algorithm
Based on the convex-concave relaxation procedure (CCRP), the (extended) path following algorithms were recently proposed to approximately solve the equal-sized graph matching problem, and exhibited a state-of-the-art performance (Zaslavskiy et al., 2009; Liu et al., 2012). However, they cannot be used for subgraph matching since either their convex or concave relaxation becomes no longer applic...
متن کاملOn the Convergence of the Concave-Convex Procedure
The concave-convex procedure (CCCP) is a majorization-minimization algorithm that solves d.c. (difference of convex functions) programs as a sequence of convex programs. In machine learning, CCCP is extensively used in many learning algorithms like sparse support vector machines (SVMs), transductive SVMs, sparse principal component analysis, etc. Though widely used in many applications, the con...
متن کاملIterative Decoding Based on the Concave-Convex Procedure
New decoding algorithms for binary linear codes based on the concave-convex procedure are presented. Numerical experiments show that the proposed decoding algorithms surpass Belief Propagation (BP) decoding in error performance. Average computational complexity of one of the proposed decoding algorithms is only a few times greater than that of the BP decoding. key words: concave-convex procedur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in intelligent systems and computing
سال: 2021
ISSN: ['2194-5357', '2194-5365']
DOI: https://doi.org/10.1007/978-3-030-73689-7_24